An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
نویسندگان
چکیده
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with the property that no two holes are within distance d. Our algorithm runs in O(nd) time and is used for the study of freeness of partial words. Furthermore, we construct an infinite word over a five-letter alphabet that is overlapfree even after the insertion of an arbitrary number of holes, answering affirmatively a conjecture from Blanchet-Sadri, Mercaş, and Scott.
منابع مشابه
Periodicity algorithms and a conjecture on overlaps in partial words
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs, if any exists, a maximal pperiodic partial word contained in w with the property that no two holes are within distance d (so-called d-valid). Our algorithm runs in O(nd) time and is used for the study of repetition-freeness of partial words. Furthermore, we construct an infinite word o...
متن کاملAbelian periods, partial words, and an extension of a theorem of Fine and Wilf
Recently, Constantinescu and Ilie proved a variant of the wellknown periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for the case of two nonrelatively prime abelian periods. In this paper, we answer some open problems they suggested. We show that their conjecture is false but we give bounds, that depend on the two abelian periods,...
متن کاملPeriodicity Algorithms for Partial Words
In this paper we investigate several periodicity-related algorithms for partial words. First, we show that all periods of a partial word of length n are determined in O(n logn), and provide algorithms and data structures that help us answer in constant time queries regarding the periodicity of their factors. For this we need a O(n2) preprocessing time and a O(n) updating time, whenever the word...
متن کاملFine and Wilf’s Theorem for Abelian Periods in Partial Words
Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods, and conjectured a result for the case of two non-relatively prime abelian periods. More precisely, they proved that any full word having two coprime abelian periods p, q and length at least 2pq− 1 has also gcd(p, q) = 1 as a period. In th...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل